منابع مشابه
An Online Algorithm for Power-proportional Data Centers with Switching Cost
Recent works show that power-proportional data centers can save energy cost by dynamically adjusting active servers based on real time workload. The data center activates servers when the workload increases and transfers servers to sleep mode during periods of low load. In this paper, we investigate the right-sizing problem with heterogeneous data centers including various operational cost and ...
متن کاملOnline solution of the average cost Kullback-Leibler optimization problem
We introduce a stochastic approximation method for the solution of a KullbackLeibler optimization problem, which is a generalization of Z-learning introduced by [Todorov, 2007]. A KL-optimization problem is Markov decision process with a finite state space and continuous control space. Because the control cost has a special form involving the Kullback-Leibler divergence, it can be shown that th...
متن کاملOnline searching with turn cost
We consider the problem of searching for an object on a line at an unknown distance OPT from the original position of the searcher, in the presence of a cost of d for each time the searcher changes direction. This is a generalization of the well-studied linear-search problem. We describe a strategy that is guaranteed to find the object at a cost of at most 9 · OPT + 2d, which has the optimal co...
متن کاملOnline Optimization with Predictions and Switching Costs: Fast Algorithms and Fundamental Limits
This paper studies an online optimization problem with switching costs and a finite prediction window. We propose a computationally efficient algorithm, Receding Horizon Gradient Descent (RHGD), which only requires a finite number of gradient evaluations at each time. We show that both the dynamic regret and the competitive ratio of the algorithm decay exponentially fast with the length of the ...
متن کاملA 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
We consider a natural online optimization problem set on the real line. The state of the online algorithm at each integer time t is a location xt on the real line. At each integer time t, a convex function ft(x) arrives online. In response, the online algorithm picks a new location xt. The cost paid by the online algorithm for this response is the distance moved, namely |xt − xt−1|, plus the va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2012
ISSN: 0163-5999
DOI: 10.1145/2425248.2425275